Multi-level pinning problems for random walks and self-avoiding lattice paths*

We consider a generalization of the classical pinning problem for integer-valued random walks conditioned to stay non-negative. More specifically, we take pinning potentials of the form ∑ j > 0 εjNj , where Nj is the number of visits to the state j and {εj} is a non-negative sequence. Partly motivated by similar problems for low-temperature contour models in statistical physics, we aim at finding a sharp characterization of the threshold of the wetting transition, especially in the regime where the variance σ of the single step of the random walk is small. Our main result says that, for natural choices of the pinning sequence {εj}, localization (respectively delocalization) occurs if σ−2 ∑ j > 0(j + 1)εj > δ −1 (respectively 6 δ), for some universal δ < 1. Our finding is reminiscent of the classical Bargmann-Jost-Pais criteria for the absence of bound states for the radial Schrödinger equation. The core of the proof is a recursive argument to bound the free energy of the model. Our approach is rather robust, which allows us to obtain similar results in the case where the random walk trajectory is replaced by a self-avoiding path γ in Z with weight exp(−β|γ|), |γ| being the length of the path and β > 0 a large enough parameter. This generalization is directly relevant for applications to the above mentioned contour models.